Swipp - a Multicomputer Framework for Bulk Synchronous Parallel Computing
نویسندگان
چکیده
A computer framework feasible for developing parallel systems according to the Bulk Synchronous Parallel (BSP) computing model is described: Switched Interconnection of Parallel Processors (Swipp). Demanding applications can be described as directed graphs where the interdependent subtasks constitute the nodes. The tasks are predistributed by a system master, Computer Executive Engine (CEE), to a set of heterogeneous computing nodes. Each computing node has a preprogrammed secondary control processor attached for performing communication and runtime tasks, thus allowing primary processors of various kinds and programming styles. Synchronization of a bulk of subactivities is done in locksteps by the CEE. Basic features are modelled by the Ptolemy framework and prototype modules are being implemented.
منابع مشابه
Efficient BSP/CGM Algorithms for Text Retrieval
In this paper we present efficient, scalable and portable parallel algorithms written in the Coarse-Grained Multicomputer (CGM) and the Bulk Synchronous Parallel (BSP) models for the off-line clustering, the on-line retrieval and the update phases of the text retrieval problem based on the vector space model and using clustering to organize and handle a dynamic document collection. To the best ...
متن کاملThe Heterogeneous Bulk Synchronous Parallel Model
Trends in parallel computing indicate that heterogeneous parallel computing will be one of the most widespread platforms for computation-intensive applications. A heterogeneous computing environment o ers considerably more computational power at a lower cost than a parallel computer. We propose the Heterogeneous Bulk Synchronous Parallel (HBSP) model, which is based on the BSP model of parallel...
متن کاملCommunication-Efficient Parallel Sorting
We study the problem of sorting n numbers on a p-processor bulk-synchronous parallel (BSP) computer, which is a parallel multicomputer that allows for general processor-to-processor communication rounds provided each processor sends and receives at most h items in any round. We provide parallel sorting methods that use internal computation time that is O(*) and a number of communication rounds ...
متن کاملEfficiency of Parallel Genetic Algorithm for Solving N-Queens Problem on Multicomputer Platform
The paper investigates the efficiency of parallel genetic algorithm for solving N-queens problem on a multicomputer platform. The proposed parallel computational model of the genetic algorithm is based on a parallel algorithmic paradigm of synchronous iterations. Dynamic migration of randomly selected chromosomes in a bidirectional circular model is utilized. The algorithm is implemented using ...
متن کاملScalable Parallel Computing: A Grand Unified Theory and its Practical Development
The Bulk Synchronous Parallel (BSP) model provides a uniied framework for the design and programming of general purpose parallel computing systems. In this paper we describe the BSP model and discuss some of the developments in architecture, algorithms and programming languages which are currently being pursued as part of this new, uniied approach to scalable parallel computing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008